Subspace Arrangements Defined by Products of Linear Forms
نویسندگان
چکیده
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields such generators in cases with a lot of combinatorial structure, and we present the examples that motivated our work. We give a construction which produces all elements of this type in the vanishing ideal of the arrangement. This leads to an algorithm for deciding if the ideal is generated by products of linear forms. We also consider generic arrangements of points in P and lines in P.
منابع مشابه
73 v 3 2 1 Se p 20 04 SUBSPACE ARRANGEMENTS DEFINED BY PRODUCTS OF LINEAR FORMS
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a com-binatorial construction (blocker duality) which yields such generators in cases with a lot of combinatorial structure, and we present the examples that motivated our work. We give a construction which produces al...
متن کاملLine Arrangements Modeling Curves of High Degree: Equations, Syzygies and Secants
We study curves consisting of unions of projective lines whose intersections are given by graphs. Under suitable hypotheses on the graph, these so-called graph curves can be embedded in projective space as line arrangements. We discuss property Np for these embeddings and are able to produce products of linear forms that generate the ideal in certain cases. We also briefly discuss questions reg...
متن کاملEdge Colored Hypergraphic Arrangements
A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a generalized chromatic polynomial of the associated edge colored hypergraph. The main result of this paper supplies a sufficient condition for the existence of non-t...
متن کاملSkeleton simplicial evaluation codes
For a subspace arrangement over a finite field we study the evaluation code defined on the arrangements set of points. The length of this code is given by the subspace arrangements characteristic polynomial. For coordinate subspace arrangements the dimension is bounded below by the face vector of the corresponding simplicial complex. The minimum distance is determined for coordinate subspace ar...
متن کاملDerivation radical subspace arrangements
In this note we study modules of derivations on collections of linear subspaces in a finite dimensional vector space. The central aim is to generalize the notion of freeness from hyperplane arrangements to subspace arrangements. We call this generalization ‘derivation radical’. We classify all coordinate subspace arrangements that are derivation radical and show that certain subspace arrangemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005